Solve the split equality problem by a projection algorithm with inertial effects
نویسندگان
چکیده
The split equality problem has wide applicability in many fields of applied mathematics. In this paper, by using the inertial extrapolation, we introduce an inertial projection algorithm for solving the split equality problem. The weak convergence of the proposed algorithm is shown. Finally, we present a numerical example to illustrate the efficiency of the inertial projection algorithm. c ©2017 All rights reserved.
منابع مشابه
Simultaneous and semi-alternating projection algorithms for solving split equality problems
In this article, we first introduce two simultaneous projection algorithms for solving the split equality problem by using a new choice of the stepsize, and then propose two semi-alternating projection algorithms. The weak convergence of the proposed algorithms is analyzed under standard conditions. As applications, we extend the results to solve the split feasibility problem. Finally, a numeri...
متن کاملStrong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms
Our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real Hilbert space. So many have used algorithms involving the operator norm for solving split equality fixed point problem, ...
متن کاملExtensions of the CQ Algorithm for the Split Feasibility and Split Equality Problems∗
The convex feasibility problem (CFP) is to find a member of the intersection of finitely many closed convex sets in Euclidean space. When the intersection is empty, one can minimize a proximity function to obtain an approximate solution to the problem. The split feasibility problem (SFP) and the split equality problem (SEP) are generalizations of the CFP. The approximate SFP (ASFP) and approxim...
متن کاملA Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem
This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem. ...
متن کاملFuzzy Vehicle Routing Problem with Split Delivery: Trade-off between Air Pollution and Customer Satisfaction
In large-scale emergency, the vehicle routing problem focuses on finding the best routes for vehicles. The equitable distribution has a vital role in this problem to decrease the number of death and save people's lives. In addition to this, air pollution is a threat to people’s life and it can be considered to omit other kinds of disasters happens because of it. So, a new MINLP model presented ...
متن کامل